Optimal ternary cyclic codes with minimum distance four and five

نویسندگان

  • Nian Li
  • Chunlei Li
  • Tor Helleseth
  • Cunsheng Ding
  • Xiaohu Tang
چکیده

Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first family of cyclic codes has parameters [3m−1,3m−1−2m,4] and contains a class of conjectured cyclic codes and several new classes of optimal cyclic codes. The second family of cyclic codes has parameters [3m − 1,3m − 2− 2m,5] and contains a number of classes of cyclic codes that are obtained from perfect nonlinear functions over F3m , where m > 1 and is a positive integer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the minimum distance of ternary cyclic codes

There are many ways to find lower bounds for the minium distance of a cyclic code, based on investigation of the defining set. Some new theorems are derived. These and earlier techniques are applied to find lower bounds for the minimum distance of ternary cyclic codes. Furthermore, the exact minimum distance of ternary cyclic codes of length less than 40 is computed numerically. A table is give...

متن کامل

Optimal ternary constant-composition codes with weight four and distance six

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of len...

متن کامل

New Good Quasi-cyclic Codes over Gf(3)

Abstract In this paper some good quasi-cyclic codes over GF(3) are presented. These quasi-cyclic codes improve the already known lower bounds on the minimum distance of the previously known quasi-cyclic codes. Even though these codes do not improve the minimum distance of the best unstructured code known, their beautiful structure and simplicity provide several advantages in comparison to other...

متن کامل

A class of optimal ternary cyclic codes and their duals

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let m = 2l+1 for an integer l≥ 1 and π be a generator of GF(3m)∗. In this paper, a class of cyclic codes C(u,v) over GF(3) with two nonzeros πu and πv is studied, where u = (3m +1)/2, and v = 2 ·3l+ 1 ...

متن کامل

Some new results for optimal ternary linear codes

Let ( ) be the maximum possible minimum Hamming distance of a ternary [ ]-code for given values of and . We describe a package for code extension and use this to prove some new exact values of ( ). Moreover, we classify the ternary [ ( )]-codes for some values of and .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2014